Extendable formulas in two variables in intuitionistic logic

نویسندگان

  • Nick Bezhanishvili
  • Dick de Jongh
چکیده

In this paper we discuss projective, exact and extendable formulas of the intuitionistic propositional calculus IPC. Exact formulas were introduced in [6] as the formulas that axiomatize the theories of substitutions. In an attempt to find a semantic characterization of exact formulas, de Jongh and Visser [7] defined the notion of extendable formulas and proved that every exact formula is extendable. Later Ghilardi [4], motivated by finding the most general unifiers for intuitionistic formulas, introduced projective formulas and proved that every extendable formula is projective and that every projective formula is exact. Thus all these three notions are equivalent. In this paper we give an alternative proof of Ghilardi’s theorem for formulas in two variables. We also give a full description of projective, exact and extendable formulas in two variables. Our main tools are the n-universal models — the general frames that are dual to Lindenbaum-Tarski algebras of IPC in n-variables.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dick de Jongh Extendible formulas in two variables in intuitionistic logic

We give alternative characterizations of exact, extendible and projective formulas in intuitionistic propositional calculus IPC in terms of n-universal models. From these characterizations we derive a new syntactic description of all extendible formulas of IPC in two variables. For the formulas in two variables we also give an alternative proof of Ghilardi’s theorem that every extendible formul...

متن کامل

Intuitionistic vs. Classical Tautologies, Quantitative Comparison

We consider propositional formulas built on implication. The size of a formula is the number of occurrences of variables in it. We assume that two formulas which differ only in the naming of variables are identical. For every n ∈ N, there is a finite number of different formulas of size n. For every n we consider the proportion between the number of intuitionistic tautologies of size n compared...

متن کامل

Classical and Intuitionistic Logic Are Asymptotically Identical

This paper considers logical formulas built on the single binary connector of implication and a finite number of variables. When the number of variables becomes large, we prove the following quantitative results: asymptotically, all classical tautologies are simple tautologies. It follows that asymptotically, all classical tautologies are intuitionistic.

متن کامل

Propositional Calculus and Realizability

In [13], Kleene formulated a truth-notion called "readability" for formulas of intuitionistic number theory(1). David Nelson(2) showed that every number-theoretic formula deducible in the intuitionistic predicate calculus(3) (stated by means of schemata, without proposition or predicate variables) from realizable number-theoretic formulas is realizable. In particular, then, every formula in the...

متن کامل

Takahito Aoto Hiroakira Ono NON-UNIQUENESS OF NORMAL PROOFS FOR MINIMAL FORMULAS IN IMPLICATION-CONJUNCTION FRAGMENT OF BCK

A minimal formula of a given logic L is a formula which is provable in L and is not a non-trivial substitution instance of other provable formulas in L. In [5], Y. Komori asked whether normal proofs of minimal formulas are unique in the implicational fragments of natural deduction systems for the intuitionistic logic and the logic BCK. It was already shown that the answer is positive for BCK, w...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007